Flow-Based White Space Allocation for Fixed-Die Standard Cell Placement

Routability is one of the most critical metrics to evaluate the quality of standard cell placement In xed die place ment white space can be used to alleviate congestion and achieve better routability In this paper we propose a new global approach to white space allocation problem for xed die placement and an e ective algorithm to allocate white space according to congestion distribution The proposed approach can be easily extended to the designs which has macros of various sizes as well as standard cells Experi mental results show that our approach generates more eas ily routable placement results than an industrial placement tool Cadence QPlace and comparable results to a state of the art academic placement tool Dragon The routing time of our placement result is shorter than those of QPlace on average